Potential isomorphism of elementary substructures of a strictly stable homogeneous model

نویسندگان

  • Sy-David Friedman
  • Tapani Hyttinen
  • Agatha Walczak-Typke
چکیده

This results herein are part of a larger project to characterize the classification properties of the class of submodels of a homogeneous stable diagram in terms of the solvability of the potential isomorphism problem for this class of submodels. We assume we work with a large strictly stable homogeneous monster model ç, and that ( = cf( ) > r(ç)). Let caP( r(ç))PIPç be the collection of pairs (A ,B) ∈ L of locally Fç r(ç)-saturated elementary substructures ofç with universe such that there is a cardinaland P( r(ç))-preserving extension of L in which A ∼= B. We show that caP( r(ç))PIPç is equiconstructible with 0 . The proof uses a novel method that does away with the need for a linear order on the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wim Veldman And

Wc establish constructive refinements of several well-known theorems in elementary model theory. The additive group of the real numbers may be embedded elementarily into the additive group of pairs of real numbers, constructively as well as classically. Introduction. Intuitionistic model theory, as we understand it, is part of intuitionistic mathematics. We study intuitionistic structures from ...

متن کامل

Homogeneous Structures

A relational first order structure is homogeneous if every isomorphism between finite substructures extends to an automorphism. Familiar examples of such structures include the rational numbers with the usual order relation, the countable random and so called Rado graph, and many others. Countable homogeneous structures arise as Fraı̈ssé limits of amalgamation classes of finite structures, and h...

متن کامل

A Minimal Rare Substructures-Based Model for Graph Database Indexing

Systems such as proteins, chemical compounds, and the Internet are stored as graph structures in graph databases. A basic, common problem in graph related applications is to find graph data that contains a query. It is not possible to scan the whole data in graph databases since subgraph isomorphism testing is an NP-complete problem. In recent years, some effective graphs indexes have been prop...

متن کامل

Some Elementary Results in Intuitionistic Model Theory Wim Veldman and Frank Waaldijk

Wc establish constructive refinements of several well-known theorems in elementary model theory. The additive group of the real numbers may be embedded elementarily into the additive group of pairs of real numbers, constructively as well as classically. Introduction. Intuitionistic model theory, as we understand it, is part of intuitionistic mathematics. We study intuitionistic structures from ...

متن کامل

Dynamical properties of the Automorphism Groups of the Random Poset and Random Distributive Lattice

(Throughout this paper embeddings and substructures will be understood in the usual model theoretic sense (see, e.g., Hodges [Ho]); e.g., for graphs embeddings are induced embeddings, i.e., isomorphisms onto induced subgraphs.) If K is a Fräıssé class, there is a unique, up to isomorphism, countably infinite structure K which is locally finite (i.e., finite generated substructures are finite), ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Log.

دوره 76  شماره 

صفحات  -

تاریخ انتشار 2011